Joining Longer Queues: Information Externalities in Queue Choice
نویسندگان
چکیده
A example that illustrates how observed customer behavior impacts other customers’ decisions is the selection of a restaurant whose quality is uncertain. Customers often choose the busier restaurant, inferring that other customers in that restaurant know something that they do not. In an environment with random arrival and service times, customer behavior is reflected in the lengths of the queues that form at the individual servers. Therefore, queue lengths could signal two factors—potentially higher arrivals to the server or potentially slower service at the server. In this paper, we focus on both factors when customers’ waiting costs are negligible. This allows us to understand how information externalities due to congestion impact customers’ service choice behavior. In our model, based on private information about both the service-quality and queue-length information, customers decide which queue to join. When the service rates are the same and known, we confirm that it may be rational to ignore private information and purchase from the service provider with the longer queue when only one additional customer is present in the longer queue. We find that, due to the information externalities contained in queue lengths, there exist cycles during which one service firm is thriving whereas the other is not. Which service provider is thriving depends on luck; i.e., it is determined by the private signal of the customer arriving when both service providers are idle. These phenomena continue to hold when each service facility has multiple servers, or when a facility may go out of business when it cannot attract customers for a certain amount of time. Finally, we find that when the service rates are unknown but are negatively correlated with service values, our results are strengthened; long queues are now doubly informative. The market share of the high-quality firm is higher when there is service rate uncertainty, and it increases as the service rate decreases. When the service rates are positively correlated with unknown service values, long queues become less informative and customers might even join shorter queues.
منابع مشابه
Herding in Queues with Waiting Costs: Rationality and Regret
We study how consumers with waiting cost disutility choose between two congested services of unknown service value. Consumers observe an imperfect private signal indicating which service facility may provide better service value, as well as the queue lengths at the service facilities before making their choice. If more consumers choose the same service facility because of their private informat...
متن کاملJoining Longer Queues: Information Externalities in Queue Choice1
A classic example that illustrates how observed customer behavior impacts other customers’ decisions is the selection of a restaurant whose quality is uncertain. Customers often choose the busier restaurant, inferring that other customers in that restaurant know something that they do not. In an environment with random arrival and service times, customer behavior is reflected in the lengths of ...
متن کاملOnline Technical Appendix Joining Longer Queues: Information Externalities in Queue Choice
Joining Longer Queues: Information Externalities in Queue Choice Senthil Veeraraghavan • Laurens Debo Wharton School, University of Pennsylvania, 3730 Walnut St, Philadelphia, PA 19104, USA Graduate School of Business, University of Chicago, 5807 S. Woodlawn Avenue Chicago, IL 60637 [email protected] • [email protected] PROOF of Proposition 3: We show the detailed proof that Ab is n...
متن کاملEquilibrium in Queues Under Unknown Service Times and Service Value
In the Operations Research queue-joining literature, beginning with Naor (1969), the queue joining probability is monotonic decreasing in the queue length; the longer the queue, the fewer consumers join. Recent academic and empirical evidence indicates that queue-joining probabilities may not always be decreasing in the queue length. We provide a simple explanation for these non-monotonic queue...
متن کاملA Joining Shortest Queue with MAP Inputs
In this paper we study a MAP/M/K system with join-the-shortest-queue (JSQ) discipline which consists of K servers and K queues with infinite buffers. An arrival joins the shortest queue and in the case that there are n (n≤ K) queues having the same shortest length, the customer will join any one of these shortest queues with probability 1/n. We model the system as a levelexpanding QBD (LDQBD) p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Manufacturing & Service Operations Management
دوره 11 شماره
صفحات -
تاریخ انتشار 2009